Congruence Networks for Strong Semilattices of Regular Simple Semigroups
نویسندگان
چکیده
منابع مشابه
The Structure of Endomorphism monoids of Strong semilattices of left simple semigroups
Endomorphism monoids have long been of interest in universal algebra and also in the study of particular classes of algebraic structures. For any algebra, the set of endomorphisms is closed under composition and forms a monoid (that is, a semigroup with identity). The endomorphism monoid is an interesting structure from a given algebra. In this thesis we study the structure and properties of th...
متن کاملCongruence Lattices of Semilattices
The main result of this paper is that the class of congruence lattices of semilattices satisfies no nontrivial lattice identities. It is also shown that the class of subalgebra lattices of semilattices satisfies no nontrivial lattice identities. As a consequence it is shown that if 5^* is a semigroup variety all of whose congruence lattices satisfy some fixed nontrivial lattice identity, then a...
متن کاملCongruence lattices of pseudocomplemented semilattices
Congruence lattices of algebras in various varieties have been studied extensively in the literature. For example, congruence lattices (i.e. lattices of ideals) of Boolean algebras were characterized by Nachbin [18] (see also Gratzer [9] and Jonsson [16]) while congruence lattices of semilattices were investigated by Papert [19], Dean and Oehmke [4] and others. In this paper we initiate the inv...
متن کاملOn Regular Anti-congruence in Anti-ordered Semigroups
For an anti-congruence q we say that it is regular anti-congruence on semigroup (S,=, =, ·, α) ordered under anti-order α if there exists an antiorder θ on S/q such that the natural epimorphism is a reverse isotone homomorphism of semigroups. Anti-congruence q is regular if there exists a quasi-antiorder σ on S under α such that q = σ ∪ σ−1. Besides, for regular anti-congruence q on S, a constr...
متن کاملCongruence Lattices of Semilattices with Operators
We begin by recalling the general theory of adjoints on finite semilattices. A finite join semilattice with 0 is a lattice, with the naturally induced meet operation. Thus a finite lattice S can be regarded as a semilattice in two ways, either S = 〈S,+, 0〉 or S = 〈S,∧, 1〉. Given a (+, 0)-homomorphism g : S → T , define the adjoint h : T → S by h(t) = ∑ {s ∈ S : gs ≤ t} so that gs ≤ t iff s ≤ ht...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1993
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181072499